https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:43466 max(G), which is the maximum number of circles of states of the link diagram D(G) corresponding to a plane (positive) graph G. We show that s_max(G) does not depend on the embedding of G and if G is a 4-edge-connected plane graph then s_max(G) is equal to the number of faces of G, which cover the results of S. Y. Liu and H. P. Zhang as special cases.]]> Tue 20 Sep 2022 09:10:20 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:25392 Sat 24 Mar 2018 07:39:07 AEDT ]]>